Convex Optimization: Algorithms and Complexity
نویسندگان
چکیده
منابع مشابه
Convex Optimization: Algorithms and Complexity
This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural optimization and stochastic optimization. Our presentation of black-box optimization, strongly influenced by Nesterov’s seminal book and Nemirovski’s lecture n...
متن کاملComplexity of Convex Optimization
We consider a situation where each one of two processors has access to a different convex function fi, i = 1,2, defined on a common bounded domain. The processors are to exchange a number of binary messages, according to some protocol, until they find a point in the domain at which fl + f2 is minimized, within some prespecified accuracy E. Our objective is to determine protocols under which the...
متن کاملConvex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. This connection allows us to give a complete characterization of the complexity of all these problems in terms of the number of occurrences of each color in the input instance, and consequently, to present simpler NP-har...
متن کاملDistributed Non-Convex First-Order Optimization and Information Processing: Lower Complexity Bounds and Rate Optimal Algorithms
We consider a class of distributed non-convex optimization problems often arises in modern distributed signal and information processing, in which a number of agents connected by a network G collectively optimize a sum of smooth (possibly non-convex) local objective functions. We address the following fundamental question: For a class of unconstrained non-convex problems with Lipschitz continuo...
متن کاملLocal Minimax Complexity of Stochastic Convex Optimization
We extend the traditional worst-case, minimax analysis of stochastic convex optimization by introducing a localized form of minimax complexity for individual functions. Our main result gives function-specific lower and upper bounds on the number of stochastic subgradient evaluations needed to optimize either the function or its “hardest local alternative” to a given numerical precision. The bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations and Trends® in Machine Learning
سال: 2015
ISSN: 1935-8237,1935-8245
DOI: 10.1561/2200000050